A (1− 1/e)-approximation algorithm for the maximum generalized assignment problem with fixed profits
نویسندگان
چکیده
The Max-Profit Generalized Assignment Problem (Max-GAP) is: given sets J of bins and I of items, where each j ∈ J has capacity c(j) and each i ∈ I has in bin j size `(i, j) and profit p(i, j), find a maximum profit feasible assignment. The problem admits a 1/2-approximation algorithm. Our main result is a (1− 1/e)-approximation algorithm for Max-GAP with fixed profits when each i ∈ I has a fixed profit p(i, j) = p(i). We also give a fast 1/2-approximation algorithm for the Multiple Knapsack with Assignment Restrictions (MKAR) problem. Key-words. Generalized assignment, Approximation algorithm.
منابع مشابه
Approximation Algorithms for Generalized Assignment Problems
We consider a class of max-profit scheduling problems that occur naturally in many different applications, all involving assignment of jobs to multiple resources under a set of constraints. In the Max-Profit Generalized Assignment Problem (Max-GAP), we are given a set J of m bins (knapsacks), and a set I of n items. Each bin j ∈ J has capacity c(j). Each item i ∈ I has in bin j size `(i, j) and...
متن کاملA (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 − 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best known approximation ratio for this problem was 1/2. Key-words. Generalized assignment, Approximation algorithm.
متن کاملTight Approximation Algorithms for Maximum Separable Assignment Problems
A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, fij , for assigning item j to bin i; and a separate packing constraint for each bin—i.e., for each bin, a family of subsets of items that fit in to that bin. The goal is to pack items into bins to maximize the aggregate value. This class of problems includes the maximum generalized ...
متن کاملImproved Approximations for Non-monotone Submodular Maximization with Knapsack Constraints
Submodular maximization generalizes many fundamental problems in discrete optimization,including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility loca-tion and marketing over social networks.In this paper we consider the problem of maximizing any submodular function subject to dknapsack constraints, where d is a fixed constant. We establish a strong ...
متن کاملApproximating Interval Scheduling Problems with Bounded Profits
We consider the Generalized Scheduling Within Intervals (GSWI) problem: given a set J of jobs and a set I of intervals, where each job j ∈ J has in interval I ∈ I length (processing time) `j,I and profit pj,I , find the highest-profit feasible schedule. The best approximation ratio known for GSWI is (1/2 − ε). We give a (1 − 1/e − ε)approximation scheme for GSWI with bounded profits, based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005